@InProceedings{AnguhMart:1994:FaMeCo,
               author = "Anguh, Maurence M. and Martin, Ralph R.",
          affiliation = "{Department of Electrical Engineering of Centro Tecnol{\'o}gia of 
                         Federal University of Maranh{\~a}o (UFMA)} and {Department of 
                         Computing Mathematics (UWCC)}",
                title = "Faster methods for computing slant haar transforms of digital 
                         images",
            booktitle = "Anais...",
                 year = "1994",
               editor = "Freitas, Carla dal Sasso and Geus, Klaus de and Scheer, 
                         S{\'e}rgio",
                pages = "125--132",
         organization = "Simp{\'o}sio Brasileiro de Computa{\c{c}}{\~a}o Gr{\'a}fica e 
                         Processamento de Imagens, 7. (SIBGRAPI)",
            publisher = "Sociedade Brasileira de Computa{\c{c}}{\~a}o",
              address = "Porto Alegre",
             keywords = "Truncation Slant Haar Transform, Slant Haar Transform, Fast Slant 
                         Haar Transform, digital images, faster methods for computing, 
                         imaging.",
             abstract = "A phenomenon characteristic of digital images is the presence of 
                         approximately constant or uniformly changing gray levels over a 
                         considerable distance or area. A novel method, the Truncation 
                         Slant Haar Transform (TSHT) method for computing the Slant Haar 
                         Transform (SHT) of digital images is presented which exploits this 
                         phenomenon to advantage. The TSHT method utilizes a hierarchical 
                         tree to segment and aggregate uniform image data and a matrix 
                         factorization to eliminate transform matrix redundancies. This 
                         simultaneous exploitation of inter-pixel relationships and the 
                         elimination of transform matrix redundancies produces an efficient 
                         method for computing the SHT of digital images. In one dimension 
                         with an array of N=2n data values, the TSHT method takes time 
                         between O (N) and (N log2 N), thus degenerating to the performance 
                         of the standard Fast Slant Haar Transform (FSHT) method. In two 
                         dimensions with an array of size N x N, the performance of the 
                         TSHT method is between O (N2) and O (N2 log2 N), again 
                         degenerating to that of the FSHT method in its worst case. Since 
                         coherence is a fundamental characteristic of digital images, the 
                         TSHT method is therefore superior to the FSHT method when used to 
                         compute the SHT of coherent digital images. Experimental results 
                         are presented to justify this assertion.",
  conference-location = "Curitiba, PR, Brazil",
      conference-year = "9-11 Nov. 1994",
                 isbn = "978-85-7669-272-0",
             language = "en",
                  ibi = "8JMKD3MGPBW34M/3DE3LAP",
                  url = "http://urlib.net/ibi/8JMKD3MGPBW34M/3DE3LAP",
           targetfile = "17 Faster methods for computing slant haar transforms of digital 
                         images.pdf",
                 type = "Processamento de Imagens II",
               volume = "1",
        urlaccessdate = "2024, May 01"
}